Minimal Error Constant Numerical Differentiation (N.D.) Formulas
نویسندگان
چکیده
منابع مشابه
Error formulas for divided difference expansions and numerical differentiation
Here, and throughout the paper, we will assume that x0 ≤ x1 ≤ . . . ≤ xn are arbitrarily spaced real values and x is any real value in the interval [x0, xn]. We refer the reader to Conte and de Boor [1 ] for basic properties of divided differences. Two things are required: evaluation of the coefficients ck; and a bound on the remainder term Rp in terms of the maximum grid spacing h := max 0≤i≤n...
متن کاملPresentation, error analysis and numerical experiments on a group of 1-step-ahead numerical differentiation formulas
In order to achieve higher computational precision in approximating the first-order derivative of the target point, the 1-step-ahead numerical differentiation formulas are presented. These formulas greatly remedy some intrinsic weaknesses of the backward numerical differentiation formulas, and overcome the limitation of the central numerical differentiation formulas. In addition, a group of for...
متن کاملError bounds for kernel-based numerical differentiation
The literature on meshless methods observed that kernel-based numerical differentiation formulae are robust and provide high accuracy at low cost. This paper analyzes the error of such formulas, using the new technique of growth functions. It allows to bypass certain technical assumptions that were needed to prove the standard error bounds on interpolants and their derivatives. Since differenti...
متن کاملMinimum Norm Differentiation Formulas with Improved Roundoff Error Bounds
Numerical differentiation formulas of the form ^f-i >"t\. We consider formulas that have minimum norm 2~L'i-i wl ar>d converge to /(m)(a) as ß — a —♦ 0. The resulting roundoff error bounds can be several orders of magnitude less than corresponding bounds for...
متن کاملAcyclic Formulas and Minimal Unsatisfiability⋆
We call a boolean formula (in CNF) stable acyclic if the associated digraph is free of a certain type of cycles. We show that satisfiability and recognition are polynomial–time solvable problems for stable acyclic formulas. Further, we show that a minimal unsatisfiable formula is stable acyclic if and only if the number of clauses exceeds the number of variables exactly by one (this subclass of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1972
ISSN: 0025-5718
DOI: 10.2307/2005173